Minimum-Recombinant Haplotyping in Pedigrees
نویسندگان
چکیده
منابع مشابه
Minimum-recombinant haplotyping in pedigrees.
This article presents a six-rule algorithm for the reconstruction of multiple minimum-recombinant haplotype configurations in pedigrees. The algorithm has three major features: First, it allows exhaustive search of all possible haplotype configurations under the criterion that there are minimum recombinants between markers. Second, its computational requirement is on the order of O(J(2)L(3)) in...
متن کاملHaplotyping via minimum recombinant paradigm
BACKGROUND Haplotypes can increase the power of gene detection over genotypes and are essential to estimate linkage disequilibrium. METHODS Haplotyping was based on the minimum recombinant paradigm, whereby a phase is obtained only if it uniquely minimises the number of recombinants within a full sib family. Performance of this method was tested across three different data sets, consisting of...
متن کاملConditional probability methods for haplotyping in pedigrees.
Efficient haplotyping in pedigrees is important for the fine mapping of quantitative trait locus (QTL) or complex disease genes. To reconstruct haplotypes efficiently for a large pedigree with a large number of linked loci, two algorithms based on conditional probabilities and likelihood computations are presented. The first algorithm (the conditional probability method) produces a single, appr...
متن کاملMinimum Recombinant Haplotype Configuration on Tree Pedigrees (Extended Abstract)
We study the problem of reconstructing haplotype configurations from genotypes on pedigree data under the Mendelian law of inheritance and the minimum recombination principle, which is very important for the construction of haplotype maps and genetic linkage/association analysis. Li and Jiang [9, 10] recently proved that the Minimum Recombinant Haplotype Configuration (MRHC) problem is NP-hard,...
متن کاملMaximum likelihood haplotyping for general pedigrees.
Haplotype data is valuable in mapping disease-susceptibility genes in the study of Mendelian and complex diseases. We present algorithms for inferring a most likely haplotype configuration for general pedigrees, implemented in the newest version of the genetic linkage analysis system SUPERLINK. In SUPERLINK, genetic linkage analysis problems are represented internally using Bayesian networks. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The American Journal of Human Genetics
سال: 2002
ISSN: 0002-9297
DOI: 10.1086/340610